全文获取类型
收费全文 | 10835篇 |
免费 | 1305篇 |
国内免费 | 520篇 |
专业分类
化学 | 1143篇 |
晶体学 | 18篇 |
力学 | 1185篇 |
综合类 | 346篇 |
数学 | 6769篇 |
物理学 | 3199篇 |
出版年
2024年 | 19篇 |
2023年 | 108篇 |
2022年 | 240篇 |
2021年 | 297篇 |
2020年 | 233篇 |
2019年 | 242篇 |
2018年 | 277篇 |
2017年 | 414篇 |
2016年 | 525篇 |
2015年 | 344篇 |
2014年 | 654篇 |
2013年 | 725篇 |
2012年 | 590篇 |
2011年 | 653篇 |
2010年 | 523篇 |
2009年 | 681篇 |
2008年 | 714篇 |
2007年 | 723篇 |
2006年 | 590篇 |
2005年 | 536篇 |
2004年 | 483篇 |
2003年 | 403篇 |
2002年 | 388篇 |
2001年 | 321篇 |
2000年 | 284篇 |
1999年 | 250篇 |
1998年 | 239篇 |
1997年 | 206篇 |
1996年 | 177篇 |
1995年 | 139篇 |
1994年 | 90篇 |
1993年 | 99篇 |
1992年 | 90篇 |
1991年 | 44篇 |
1990年 | 52篇 |
1989年 | 36篇 |
1988年 | 38篇 |
1987年 | 36篇 |
1986年 | 40篇 |
1985年 | 35篇 |
1984年 | 32篇 |
1983年 | 10篇 |
1982年 | 21篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 10篇 |
1977年 | 7篇 |
1973年 | 3篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
11.
Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when
viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms
whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential
equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration
process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using
the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order
algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions”
defined by nonvanishing Lie brackets. 相似文献
12.
Jinchao Xu 《应用数学学报(英文版)》2002,18(2):185-200
Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids. 相似文献
13.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
14.
An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines 总被引:2,自引:0,他引:2
Luca Zanni 《Computational Management Science》2006,3(2):131-145
In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in
training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to
optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative
features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special
rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing
the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We
improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each
iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison
with a widely used decomposition package. 相似文献
15.
R. J. Vanderbei 《Mathematical Programming》1989,43(1-3):31-44
The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual. 相似文献
16.
L. Aggoun 《Mathematical and Computer Modelling》2002,36(11-13)
In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model. 相似文献
17.
18.
19.
R. S. Martynov Yu. M. Nechepurenko 《Computational Mathematics and Mathematical Physics》2006,46(7):1155-1167
For a discrete linear stochastic dynamical system, computation of the response matrix to the external action from a subspace using given observational data is examined. An algorithm is proposed and substantiated that makes it possible to improve the numerical accuracy and to reduce the amount of observational data compared to the general case where an arbitrary external action is allowed. As an illustration, a discrete system arising in the analysis of a linear stochastic dynamical continuous-time system is considered more thoroughly. Some numerical results are presented. 相似文献
20.
A. A. Abramov S. V. Kurochkin 《Computational Mathematics and Mathematical Physics》2006,46(6):949-954
A new method for calculating the radial spheroidal functions of the first kind is proposed for the arguments that are greater than unity in modulus. A well-known representation of these functions is refined and used for this purpose. The constructs and the software implementation proposed in the paper provide an efficient tool for the calculation of the functions with a desired accuracy in a wide range of parameters. 相似文献